Mobile clinics: medical service strategy for disaster healthcare response operation

Purpose:Healthcare facilities disrupted due to disasters leave affected communities without access tosufficient health care. This study proposes the use of mobile health clinics (MHCs) to address the issuesfaced by medical service providers during disaster response.Design/methodology/approach:An MHC is a mobile facility that provides healthcare services from astationary location. The model was developed as a healthcare response strategy that considers demanduncertainties due to the nature of the disaster. Therefore, the objective of this study is to generate anMHC route and schedule simultaneously and determine how each MHC meets patient demands within aprespecified time horizon. A stochastic model is presented because the impact of a disaster variesaccording to its scale.Findings:An investigation of medical shelters in locations with high numbers of displaced people andthe routing of mobile clinics for several facility locations with a small number of people showed that ahybrid strategy comprising a medical shelter and MHC is the best option. MHCs can serve many locationswithin walking distance. They can also be routed to other locations when time constraints allow. When alarge number of people are in a shelter, building a medical facility provides better service.Originality/value:This study proposed MHCs as a medical service strategy to address the challengesfaced by communities during disaster responses. The aim of MHCs is to improve communities’ access tohealthcare servicesPeer Reviewe

Tabu search heuristic for inventory routing problem with stochastic demand and time windows

This study proposes the hybridization of tabu search (TS) and variable neighbourhood descent (VND) for solving the Inventory Routing Problems with Stochastic Demand and Time Windows (IRPSDTW). Vendor Managed Inventory (VMI) is among the most used approaches for managing supply chains comprising multiple stakeholders, and implementing VMI require addressing the Inventory Routing Problem (IRP). Considering practical constraints related to demand uncertainty and time constraint, the proposed model combines multi-item replenishment schedules with unknown demand to arrange delivery paths, where the actual demand amount is only known upon arrival at a customer location with a time limit. The proposed method starts from the initial solution that considers the time windows and uses the TS method to solve the problem. As an extension, the VND is conducted to jump the solution from its local optimal. The results show that the proposed method can solve the IRPSDTW, especially for uniformly distributed customer locations

Perancangan Strategi Pemasaran Menggunakan Metode SWOT dan QSPM untuk Meningkatkan Penjualan Beras

Salah satu komoditas pangan yang merupakan makanan pokok masyarakat Indonesia adalah beras. PT.XYZ merupakan perusahaan yang fokus dalam peningkatan produksi, kualitas serta pemerataan distribusi beras di Indonesia. Banyaknya kompetitor swasta yang tidak terikat dengan pemerintah menjadi sebuah tantangan bagi perusahaan untuk dapat bersaing dalam memasarkan produk berasnya. Penelitian ini mengambil studi kasus pada salah satu cabang perusahaan. Penelitian ini bertujuan untuk mengetahui faktor internal dan eksternal serta membuat rekomendasi strategi untuk perbaikan pemasaran pada perusahaan dengan metode analisis SWOT dan QSPM. Hasil analisis SWOT menunjukkan perusahaan berposisi pada kuadran III dan disarankan mengubah strategi pe­masa­ran yang telah ada. Berdasarkan matriks weaknesses – opportunity.  Alternatif strategi yang ada dianalisis menggunakan QSPM. Skor TAS tertinggi pada analisis matrix QSPM sebesar 3,75. Strategi yang terpilih adalah membuat strategi promosi yang unik untuk menarik minat masyarakat ditengah harga pasar yang tinggi

Cuckoo search algorithm for construction site layout planning

A novel metaheuristic optimization algorithm based on cuckoo search algorithm (CSA) is presented to solve the construction site layout planning problem (CSLP). CSLP is a complex optimization problem with various applications, such as plant layout, construction site layout, and computer chip layout. Many researchers have investigated the CSLP by applying many algorithms in an exact or heuristic approach. Although both methods yield a promising result, technically, nature-inspired algorithms demonstrate high achievement in successful percentage. In the last two decades, researchers have been developing a new nature-inspired algorithm for solving different types of optimization problems. The CSA has gained popularity in resolving large and complex issues with promising results compared with other nature-inspired algorithms. However, for solving CSLP, the algorithm based on CSA is still minor. Thus, this study proposed CSA with additional modification in the algorithm mechanism, where the algorithm shows a promising result and can solve CSLP cases.publishedVersionPeer reviewe